Reversible parallel communicating finite automata systems

Abstract We study the concept of reversibility in connection with parallel communicating systems finite automata (PCFA short). define notion case PCFA (also covering non-deterministic case) and discuss relationship its components. show that a system can be reversible non-reversible components, other way around, components does not necessarily imply as whole. also investigate computational power deterministic centralized PCFA. these very simple types (returning or non-returning) recognize regular languages which cannot accepted by (deterministic) automata, they even accept are context-free. separate variants non-returning communication. there PCFA, recognized any variant same type.